Asymmetric Leaky Private Information Retrieval
نویسندگان
چکیده
Information-theoretic formulations of the private information retrieval (PIR) problem have been investigated under a variety scenarios. Symmetric (SPIR) is variant where user able to privately retrieve one out K messages from N non-colluding replicated databases without learning anything about remaining K-1 messages. However, goal perfect privacy can be too taxing for certain applications. In this paper, we investigate if information-theoretic capacity SPIR (equivalently, inverse minimum download cost) increased by relaxing both and DB definitions. Such relaxation relevant in applications traded communication efficiency. We introduce Asymmetric Leaky PIR (AL-PIR) model with different leakage budgets each direction. For leakage, bound probability ratios between all possible realizations queries function non-negative constant ?. privacy, mutual undesired messages, queries, answers, ?. propose general AL-PIR scheme that achieves an upper on optimal cost arbitrary ? show upper-bounded as D * (?,?) ? 1+\frac 1N-1-\frac ?e xmlns:xlink="http://www.w3.org/1999/xlink">? xmlns:xlink="http://www.w3.org/1999/xlink">K-1 -1. Second, obtain lower ? 1Ne -1-\frac ?(Ne ) The gap analysis two bounds shows our when = 0, i.e., it within maximum multiplicative \frac N-e xmlns:xlink="http://www.w3.org/1999/xlink">-? N-1 any > 0 ? 0.
منابع مشابه
Asymmetry Hurts: Private Information Retrieval Under Asymmetric Traffic Constraints
We consider the classical setting of private information retrieval (PIR) of a single message (file) out of M messages from N distributed databases under the new constraint of asymmetric traffic from databases. In this problem, the ratios between the traffic from the databases are constrained, i.e., the ratio of the length of the answer string that the user (retriever) receives from the nth data...
متن کاملEfficient Private Information Retrieval
Informally, private information retrieval for k >= 1 databases (k-PIR) is an interactive scheme that enables a user to make access to (separated) k replicated copies of a database and privately retrieve any single bit out of the n bits of data stored in the database. In this model, “privacy” implies that the user retrieves the bit he is interested in but releases to each database nothing about ...
متن کاملPractical Private Information Retrieval
In recent years, the subject of online privacy has been attracting much interest, especially as more Internet users than ever are beginning to care about the privacy of their online activities. Privacy concerns are even prompting legislators in some countries to demand from service providers a more privacy-friendly Internet experience for their citizens. These are welcomed developments and in s...
متن کاملNearly Private Information Retrieval
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the client requested. This concept is well studied in the theoretical computer science literature. Here, we study a generalization of this idea where we allow a small amount of information about the client’s intent to be leake...
متن کاملThe Capacity of Private Information Retrieval with Private Side Information
The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, N replicated databases each store K messages, of which M are known to the user as side-information. The identity of these M messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without reveali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3085363